Parameterized and Approximation Algorithms for Boxicity

Boxicity of a graph G(V, E), denoted by box(G), is the minimum integer k such that G can be represented as the intersection graph of axis parallel boxes in R. The problem of computing boxicity is inapproximable even for graph classes like bipartite, co-bipartite and split graphs within O(n)-factor, for any ǫ > 0 in polynomial time unless NP = ZPP . We give FPT approximation algorithms for computing the boxicity of graphs, where the parameter used is the vertex or edge edit distance of the given graph from families of graphs of bounded boxicity. This can be seen as a generalization of the parameterizations discussed in [4]. Extending the same idea in one of our algorithms, we also get an O ( n √ log log n √ log n ) -factor approximation algorithm for computing boxicity, which, to our knowledge, is the first o(n) factor approximation algorithm for the boxicity problem.